Phylogenetic analysis of Fusobacterium alocis and Fusobacterium sulci based on 16S rRNA gene sequences: proposal of Filifactor alocis (Cato, Moore and Moore) comb. nov. and Eubacterium sulci (Cato, Moore and Moore) comb. nov.

ON THE CAPACITY OF EILENBERG-MACLANE AND MOORE SPACES

K. Borsuk in 1979, at the Topological Conference in Moscow, introduced concept of the capacity of a compactum and asked some questions concerning properties of the capacity ofcompacta. In this paper, we give partial positive answers to three of these questions in some cases. In fact, by describing spaces homotopy dominated by Moore and Eilenberg-MacLane spaces, the capacities of a Moore space $...

Crimmins, Gonzales and Moore

Dretske, F. 1970. Epistemic operators. Journal of Philosophy 67: 1007–23. Dretske, F. 1981. The pragmatic dimension of knowledge. Philosophical Studies 40: 363–78. Lewis, D. 1979. Scorekeeping in a language game. Journal of Philosophical Logic 8: 339–59. Lewis, D. 1996. Elusive knowledge. Australasian Journal of Philosophy 74: 549–67. Stine, G. C. 1976. Skepticism, relevant alternatives, and de...

Underhill Moore

On Moore bipartite digraphs

In the context of the degree/diameter problem for directed graphs, it is known that the number of vertices of a strongly connected bipartite digraph satisfies a Moore-like bound in terms of its diameter k and the maximum out-degrees (d1; d2) of its partite sets of vertices. It has been proved that, when d1d2 > 1, the digraphs attaining such a bound, called Moore bipartite digraphs, only exist w...

On Boyer-Moore Preprocessing

Probably the two best-known exact string matching algorithms are the linear-time algorithm of Knuth, Morris and Pratt (KMP), and the fast on average algorithm of Boyer and Moore (BM). The efficiency of these algorithms is based on using a suitable failure function. When a mismatch occurs in the currently inspected text position, the purpose of a failure function is to tell how many positions th...